Ground-state geometric quantum computing in superconducting systems
نویسندگان
چکیده
منابع مشابه
Superconducting circuits for quantum computing
Superconducting circuits provide one of the numerous current candidate routes for the realization of quantum computing (QC) technology. In this paper I review the basic physics behind this candidature and outline some superconducting QC proposals currently on the table, demonstrating their common origins. More detailed discussion of the proposals follows, assessing how they measure up to the \D...
متن کاملSuperconducting Quantum Computing without Switches
This paper presents a very simple architecture for a large-scale superconducting quantum computer. All of the SQUID qubits are fixed-coupled to a single large superconducting loop.
متن کاملGround State Entanglement in One Dimensional Translationally Invariant Quantum Systems
We examine whether it is possible for one-dimensional translationally-invariant Hamiltonians to have ground states with a high degree of entanglement. We present a family of translationally invariant Hamiltonians {Hn} for the infinite chain. The spectral gap of Hn is Ω(1/poly(n)). Moreover, for any state in the ground space of Hn and anym, there are regions of sizem with entanglement entropy Ω(...
متن کاملQuantum computing with many superconducting qubits
Two of the major obstacles to achieve quantum computing (QC) are (i) scalability to many qubits and (ii) controlled connectivity between any selected qubits. Using Josephson charge qubits, here we propose an experimentally realizable method to efficiently solve these two central problems. Since any two charge qubits can be effectively coupled by an experimentally accessible inductance, the prop...
متن کاملType-II Quantum computing Using superconducting Qubits
Most algorithms designed for quantum computers will not best their classical counterparts until they are implemented with thousands of qubits. For example, the factoring of binary numbers with a quantum computer is estimated to be faster than a classical computer only when the length of the number is greater than about 500 digits [1]. In contrast, the Factorized Quantum Lattice-Gas Algorithm (F...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2010
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.82.052304